Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Borse, Y. M.
- On Removable and Non-Separating Even Cycles in Graphs
Abstract Views :210 |
PDF Views:0
Authors
Y. M. Borse
1,
B. N. Waphare
1
Affiliations
1 Department of Mathematics, University of Pune, Pune 411007, IN
1 Department of Mathematics, University of Pune, Pune 411007, IN
Source
The Journal of the Indian Mathematical Society, Vol 80, No 3-4 (2013), Pagination: 221-234Abstract
Conlon proved that there exists an even cycle C in a 3-connected graph ≅K5, of minimum degree at least 4 such that G-E(C) is 2-connected and G - V(C) is connected. We prove that a 2-connected graph G of minimum degree at least 5 has an even cycle C such that G - E(C) is 2-connected and G - V(C) is connected.Keywords
2-Connected Graph, Even Cycle.- On Removable Cycles in Connected Graphs
Abstract Views :205 |
PDF Views:0
Authors
Y. M. Borse
1,
B. N. Waphare
1
Affiliations
1 Department of Mathematics, University of Pune, Pune 411 007, IN
1 Department of Mathematics, University of Pune, Pune 411 007, IN